3-2 Linear Tape
نویسندگان
چکیده
منابع مشابه
Control of Time-varying Lateral Tape Motion in a Linear-tape-open Drive via Adaptive Regulation
Introduction This extended abstract summarizes a methodology along with the experimental results to adaptively reduce timevarying lateral tape motion (LTM) in a Linear Tape-Open (LTO) drive. For the adaptive regulation, the LTO actuator dynamics is modeled with a Linear Time Invariant (LTI) model and control of time-varying LTM disturbances is done via an adaptable linear feedback controller. A...
متن کاملInfinite Games Specified by 2-Tape Automata
We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. Then we prove that winning strategies, when they exist, can be very complex, i.e. highly non-effective, in these games. We prove the...
متن کاملOnline Algorithms for the Linear Tape Scheduling Problem
Even in today’s world of increasingly faster storage technologies, magnetic tapes continue to play an essential role in the market. Yet, they are often overlooked in the literature, despite the many changes made to the underlying tape architecture since they were conceived. In this article, we introduce the LINEAR TAPE SCHEDULING PROBLEM (LTSP), which aims to identify scheduling strategies for ...
متن کاملTheory of One Tape Linear Time Turing Machines
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) ...
متن کاملVerifying whether One-Tape Turing Machines Run in Linear Time
We discuss the following family of problems, parameterized by integersC ≥ 2 andD ≥ 1: Does a given one-tape q-state Turing machine make at mostCn+D steps on all computations on all inputs of length n, for all n? Assuming a fixed tape and input alphabet, we show that these problems are co-NP-complete and we provide good lower bounds. Specifically, these problems can not be solved in o(q(C−1)/4) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of The Institute of Image Information and Television Engineers
سال: 2014
ISSN: 1342-6907,1881-6908
DOI: 10.3169/itej.68.35